Volume 12, Issue 2, pp. 215-410
Please Note: Electronic articles are available well in advance of the printed articles.
The Equivalence of Two Semantic Definitions: A Case Study in LCF
Avra Cohn
pp. 267-285
Computing Rational Zeros of Integral Polynomials by $p$-Adic Expansion
Rüdiger Loos
pp. 286-293
Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines
Barbara Simons
pp. 294-299
Quadratic Algorithms for Minimizing Joins in Restricted Relational Expressions
Yehoshua Sagiv
pp. 316-328
The Worst and the Most Probable Performance of a Class of Set-Covering Algorithms
V. Lifschitz and B. Pittel
pp. 329-346
Towards a Genuinely Polynomial Algorithm for Linear Programming
Nimrod Megiddo
pp. 347-353
Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems
J. A. Bergstra and J. V. Tucker
pp. 366-387
